topic signific rank lda gener model latent dirichlet bayesian dcluster project cluster ensembl investig random project cluster high dimension data random project shown promis theoret properti practic find result highli unstabl cluster perform solut random project cluster ensembl approach empir result show propos approach achiev robust cluster perform compar singl run random project cluster cluster pca tradit data reduct method high dimension data gain insight perform improv obtain ensembl method analyz identifi influenc qualiti divers individu cluster solut final ensembl perform univers text classifi transfer learn encycloped knowledg cluster ensembl activ constraint learn distanc measur learn distanc measur weight cluster ensembl method analysi weight cluster ensembl method analysi wikipedia dcluster base cross ddomain text classif tradit approach document classif requir label data order construct reliabl accur classifi label data seldom expens obtain learn task train data abund label data exist relat domain relat label data auxiliari inform accomplish classif task target domain recent paradigm transfer learn introduc enabl effect learn strategi auxiliari data obei probabl distribut cluster base classif algorithm previous propos tackl cross domain text classif work extend idea underli approach make latent semant relationship domain explicit goal achiev wikipedia result pathwai propag label domain captur common word semant concept base content document empir demonstr efficaci semant base approach cross domain classif varieti real data dline lda adapt topic model mine text stream applic topic detect track detect suspici behavior surveil imag build semant kernel text classif wikipedia cluster framework base subject object valid criteria subspac metric ensembl semi dsupervis cluster high dimension data adapt kernel method semi dsupervis cluster abstract semi supervis cluster limit background knowledg aid unsupervis cluster algorithm recent kernel method semi supervis cluster introduc shown outperform previou semi supervis cluster approach set kernel paramet left manual tune chosen larg affect qualiti result select kernel paramet remain critic open problem limit supervis provid term pairwis constraint paper deriv optim criterion automat determin optim paramet rbf kernel directli data constraint approach integr constraint cluster object function optim paramet gaussian kernel iter cluster process experiment comparison result simul real data demonstr effect advantag propos algorithm regress databas probabilist queri spars learn set introduc regress databas redb formal autom probabilist queri spars learn set redb data model involv observ data learn set data view definit regress model instanc observ data collect relat tupl set attribut learn data set involv subset observ tupl augment learn attribut model random variabl view express linear combin observ learn attribut regress model involv function map observ tupl probabl distribut random variabl learn dynam learn data set redb queri languag extend relat algebra project select queri condit probabl order logic express turn involv linear combin learn attribut view arithmet comparison oper capabl reli underli regress model learn attribut show redb queri comput develop conceptu evalu algorithm prove correct termin detect outlier transduct statist test outlier detect uncov malici behavior field intrus detect fraud analysi signific amount work outlier detect algorithm propos literatur base definit outlier densiti base ad hoc threshold detect paper present techniqu detect outlier respect exist cluster model test successfulli util recogn outlier cluster inform method base transduct confid machin previous propos mechan provid individu confid measur classif decis test hypothesi test prove disprov point fit cluster model experiment demonstr test highli robust produc misdiagnos point cluster inform experi demonstr robust method circumst data contamin outlier final show techniqu successfulli appli identifi outlier noisi data set inform ground truth cluster structur propos methodolog capabl bootstrap noisi data set clean identifi futur outlier weight cluster ensembl framework semi dsupervis learn base subject object cluster criteria error correl accuraci nearest neighbor ensembl classifi categor keyword identif unlabel document paper propos global unsupervis featur select approach text base frequent itemset mine result document repres set word occur frequent corpu document introduc local adapt cluster algorithm design estim local word relev simultan group document present experiment result demonstr feasibl approach analysi weight credit term evid identifi keyword guid process label assign cluster consider spam email filter gener classif dataset analysi distribut weight case insight spam problem distinguish gener classif case error correl accuraci nearest neighbor ensembl classifi kernel pool local subspac classif studi kernel subspac method learn low dimension represent classif propos kernel pool local discrimin subspac method compar compet techniqu princip compon analysi pca kernel pca kpca linear local pool classif problem evalu classif perform nearest neighbor rule subspac represent experiment result demonstr effect perform superior kernel pool subspac method compet method pca kpca classif problem select estim multidimension rang queri real attribut abstract estim select multi dimension rang queri real valu attribut signific applic data explor databas queri optim paper problem tabl attribut domain real number queri specifi rang dimens find good approxim number record tabl satisfi queri simplest approach tackl problem assum attribut independ accur estim captur joint data distribut attribut databas estim includ construct multi dimension histogram random sampl wavelet transform statist kernel estim techniqu tradit approach assum attribut valu discret finit domain valu high frequenc applic tempor spatial multimedia databas attribut valu infinit domain real number appear infrequ characterist affect behavior effect estim real life data exhibit attribut correl affect estim present histogram techniqu design approxim densiti multidimension dataset real attribut techniqu defin bucket variabl size bucket overlap size cell base local densiti data overlap bucket compact approxim data distribut show gener kernel densiti estim appli multi dimension queri approxim problem final compar accuraci propos techniqu exist techniqu real synthet dataset experiment result show propos techniqu behav accur high dimension previou approach nearest neighbor ensembl problem identifi mislabel train exampl examin studi varieti approach develop edit train data obtain classifi approach involv appli individu ensembl classifi train set filter mislabel exampl base consist respect classifi output studi formul mislabel detect optim problem introduc kernel base approach filter mislabel exampl experiment result varieti data set uci data repositori demonstr effect propos method compar exist nearest neighbor ensembl base filter scheme classifi document label automat classif document import area research applic field document search forens method perform classif text reli exist sampl document class label situat obtain sampl easi task instanc set document return result queri separ document relev queri hand label document train classif model perform task paper focu classif unlabel set document class relev irrelev topic interest divid set document bucket instanc answer return di erent search engin associ rule mine find common set word bucket cientli obtain sampl document larg percentag relev high puriti sampl train model classifi entir set document method classif separ document includ class svm develop heurist identifi small sampl neg exampl prove experiment method capabl accur classifi set document relev irrelev class subspac cluster high dimension data data mine applic place special requir cluster algorithm includ abil find cluster embed subspac high dimension data scalabl end user comprehens result presumpt canon data distribut insensit order input record present cliqu cluster algorithm satisfi requir cliqu identifi dens cluster subspac maximum dimension gener cluster descript form dnf express minim eas comprehens produc ident result irrespect order input record present presum specif mathemat form data distribut experi show cliqu effici find accur cluster larg high dimension dataset effici densiti dbase approach data mine task propos local adapt techniqu address problem set bandwidth paramet kernel densiti estim techniqu effici perform dataset pass show appli techniqu effici solv rang queri approxim classif cluster problem larg dataset valid effici accuraci techniqu present experiment result varieti synthet real dataset cluster gene express data sql local adapt metric group data similar measur cluster suer curs dimension meaning cluster high dimension space averag densiti point input space low consequ distanc function equal input featur ineect introduc algorithm discov cluster subspac span dierent combin dimens local weight featur approach avoid risk loss inform encount global dimension reduct techniqu method associ cluster weight vector valu captur relev featur cluster paper present ecient sql implement algorithm enabl discoveri cluster data resid insid relat dbm mine relev text unlabel document automat classif document import area research applic field document search forens method perform classif text reli exist sampl document class label situat obtain sampl easi task paper focu classif unlabel document class relev irrelev topic interest divid set document bucket instanc answer return search engin associ rule mine find common set word bucket effici obtain sampl document larg percentag relev sampl train model classifi entir set document prove experiment method capabl filter relev document advers condit percentag irrelev document bucket high dimension reduct kernel pool local discrimin inform studi kernel subspac method learn low dimension represent classif propos kernel pool local discrimin subspac method compar compet techniqu gener fisher discrimin analysi gda kernel princip compon analysi kpca classif problem evalu classif perform nearest neighbor rule subspac represent experiment result demonstr efficaci kernel pool local subspac method potenti substanti improv compet method kpca classif problem classif approach predict target event tempor sequenc learn predict signific event sequenc data categor featur import problem applic area effici local flexibl nearest neighbor classif nearest neighbor techniqu simpl appeal method address classif problem reli assumpt local constant class condit probabl assumpt invalid high dimens finit number exampl due curs dimension sever bia introduc condit nearest neighbor rule employ local adapt metric crucial order class condit probabl close uniform minim bia estim propos techniqu comput local flexibl metric mean support vector machin svm maximum margin boundari found svm determin discrimin direct queri neighborhood direct local weight scheme input featur present experiment evid formal justif classif perform improv svm algorithm varieti adapt learn scheme simul real data set propos method import advantag superior effici competit techniqu experi local adapt metric nearest dneighbor classif increment support vector machin construct svm suffer problem larg memori requir cpu time train batch mode larg data set overcom limit time make svm suitabl learn data stream construct increment learn algorithm effici approach approxim multi ddimension rang queri nearest neighbor classif larg dataset propos local adapt techniqu address problem set bandwidth paramet optim kernel densiti estim techniqu effici perform dataset pass show appli techniqu effici solv rang queri approxim classif cluster problem larg dataset valid effici accuraci techniqu present experiment result varieti synthet real dataset adapt nearest neighbor classif support vector machin nearest neighbor techniqu simpl appeal method address classif problem reli assumpt local constant class condit probabl assumpt invalid high dimens finit number exampl due curs dimension propos techniqu comput local flexibl metric mean support vector machin svm maximum margin boundari found svm determin discrimin direct queri neighborhood direct local weight scheme input featur present experiment evid classif perform improv svm algorithm varieti adapt learn scheme simul real data set adapt metric nearest neighbor classif nearest neighbor classif assum local constant class condit probabl assumpt invalid high dimens finit sampl due curs dimension sever bia introduc condit nearest neighbor rule propos local adapt nearest neighbor classif method minim bia chisquar distanc analysi comput flexibl metric produc neighborhood highli adapt queri locat neighborhood elong relev featur dimens constrict influenti result class condit probabl tend smoother modifi neighborhood classif perform achiev efficaci method valid compar techniqu varieti simul real world data introduct classif problem class tra approxim multi ddimension aggreg rang queri real attribut find approxim answer multi dimension rang queri real valu attribut signific applic data explor databas queri optim paper problem tabl attribut domain real number queri specifi rang dimens find good approxim number record tabl satisfi queri present histogram techniqu design approxim densiti multi dimension dataset real attribut techniqu find bucket variabl size bucket overlap overlap bucket effici approxim densiti size cell base local densiti data techniqu lead faster compact approxim data distribut show gener kernel densiti estim appli multi dimension queri approxim 